Four-bit Nanoadder Controlled by Five-Inputs Majority Elements
نویسندگان
چکیده
This paper presents a nano circuit of full one-bit adder on the proposed five-input majority element. innovative design is used to development four-bit based it. We offer new single-bit and in quantum-dot cellular automata technology. The utilizes only 231 quantum cells 0.49 µm2 area. It has reduction number cells, delay energy dissipation at 1 K compared existing works. QCADdesigner version 2.0.3 tool implements developed circuits. implementation results show that circuits have an improvement over other
منابع مشابه
Two Inputs Five-Level Quasi-Z-Source Inverter
This paper combines quasi-Z-source into a typical five-level inverter, which includes two dc voltage sources, two quasi-Z-sources and five switching devices. In this structure, the output voltage amplitude is not limited to dc voltage source and it can be increased by quasi-Z-source. Besides, due to nature of Z-source families, this new structure is reliable and higher efficiency. Also, in this...
متن کاملFour-Bit Wireless Link Estimation
We consider the problem of estimating link quality in an ad-hoc wireless mesh. We argue that estimating links well requires combining information from the network, link, and physical layers. We propose narrow, protocolindependent interfaces for the layers, which in total provide four bits of information: 1 from the physical layer, 1 from the link layer, and 2 from the network layer. We present ...
متن کاملCooling Algorithms Based on the 3-bit Majority
Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum computing, the most likely cooling algorithms to be practicable are those based on simple reversible polarization compression (RPC) operations acting locally on small numbers of bits. Several different algorithms usi...
متن کاملLexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements
In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Elektronìka ta sistemi upravlìnnâ
سال: 2022
ISSN: ['1990-5548']
DOI: https://doi.org/10.18372/1990-5548.74.17310